Systolic trees and systolic language recognition by tree automata
نویسندگان
چکیده
منابع مشابه
Systolic Automata and P Systems
Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient hardware implementation as multiprocessor chips. In this paper we investigate the relationship between Binary Systolic TreeAutomata (BSTA), inwhich the underlying communication structure is an infinite complete binary tree with parallel botto...
متن کاملSystolic Tree Acceptors
— This paper introduces systolic automata for VLSI as highly concurrent acceptors. Attention is focused on tree automata although other types are also discussed briefly. A number of preliminary results about the capabilities of such automata are obtained. The approach not only opens up a new and interesting area oflanguage theory but also its results give useful hints for VLSI system design par...
متن کاملSystolic Tree !-Languages
The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.
متن کاملTree language automata for melody recognition
The representation of symbolic music by means of trees has shown to be suitable in melodic similarity computation. In order to compare trees, different tree edit distances have been previously used, being their complexity a main drawback. In this paper, the application of stochastic k-testable treemodels for computing the similarity between two melodies as a probability, compared to the classic...
متن کاملFour-Dimensional Homogeneous Systolic Pyramid Automata
Cellular automaton is famous as a kind of the parallel automaton. Cellular automata were investigated not only in the viewpoint of formal language theory, but also in the viewpoint of pattern recognition. Cellular automata can be classified into some types. A systolic pyramid automata is also one parallel model of various cellular automata. A homogeneous systolic pyramid automaton with four-dim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90146-9